Combinatorial triangulations of homology spheres

نویسندگان

  • Bhaskar Bagchi
  • Basudeb Datta
چکیده

Let M be an n-vertex combinatorial triangulation of a Z2-homology d-sphere. In this paper we prove that if n ≤ d+ 8 then M must be a combinatorial sphere. Further, if n = d+ 9 and M is not a combinatorial sphere then M can not admit any proper bistellar move. Existence of a 12-vertex triangulation of the lens space L(3, 1) shows that the first result is sharp in dimension three. In the course of the proof we also show that any Z2-acyclic simplicial complex on ≤ 7 vertices is necessarily collapsible. This result is best possible since there exist 8-vertex triangulations of the Dunce Hat which are not collapsible. 2000 Mathematics Subject Classification. 57Q15, 57R05.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial 3-Manifolds with 10 Vertices

We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product S×S and 615 triangulations of the twisted sphere product S×S. All the 3-spheres with up to 10 vertices are shellable, but there are 29 vertexminimal non-shellable 3-balls with 9 vertices.

متن کامل

Statement of Research

I am a doctoral student working under the supervision of Dr. Frank Lutz at the Technische Universität Berlin in Germany. In my doctoral thesis I describe the construction of some triangulated manifolds we built by hand. We applied heuristic programs to compute certain topological properties of these simplicial complexes to verify that our construction is correct. In doing so we exposed flaws in...

متن کامل

Stacked polytopes and tight triangulations of manifolds

Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into Euclidean space is “as convex as possible”. It can thus be understood as a generalization of the concept of convexity. In even dimensions, super-neighborliness is known to be a purely combinatorial condition which implies the tightness of a triangulati...

متن کامل

A constructive proof of Ky Fan's generalization of Tucker's lemma

We present a constructive proof of Ky Fan’s combinatorial lemma concerning labellings of triangulated spheres. Our construction works for triangulations of Sn that contain a flag of hemispheres. As a consequence, we produce a constructive proof of Tucker’s lemma that holds for a larger class of triangulations than previous constructive proofs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 305  شماره 

صفحات  -

تاریخ انتشار 2005